Code Design for Discrete Memoryless Interference Channels
نویسندگان
چکیده
منابع مشابه
Discrete Memoryless Interference
We consider the discrete memoryless two-sendertwo-receiver interference channel in the setting where received Channel Encoders ~~~~~~~~~~Decoders signals are sent back to their respective senders. The feedback Encoders xi Yi ~~~~~~~~~~~~U) signals enable each sender to crossly observe certain information j 111 traiismitted by the othelr, add thus facilitate the senders to cooperate in resolving...
متن کاملDiscrete Memoryless Interference and Broadcast Channels with Confidential Messages
Discrete memoryless interference and broadcast channels in which independent confidential messages are sent to two receivers are considered. Confidential messages are transmitted to each receiver with perfect secrecy, as measured by the equivocation at the other receiver. In this paper, we derive inner and outer bounds for the achievable rate regions for these two communication systems.
متن کاملPerformance bound and trellis-code design criterion for discrete memoryless channels and finite-delay symbol-by-symbol decoding
A new tight analytical upper bound is presented for the performance of finite-delay symbol-by-symbol (SBS) Abend–Fritchman-like decoding of trellis-encoded data crossing arbitrary (eventually time-varying) discrete memoryless channels (DMC’s). On the basis of this bound, a related criterion for the optimal design of trellis codes with SBS decoding is then proposed. It gives rise to an effective...
متن کاملCommitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bid...
متن کاملUniversal decoding for memoryless Gaussian channels with a deterministic interference
A universal decoding procedure is proposed for memoryless Gaussian channels with deterministic interfering signals from a certain class. The universality of the proposed decoder is in the sense of W i g independent of the channel parameters and the unknown interfering signal, and at the same time attaining the same random coding e m r exponent as the optimal maximum likelihood (ML) decoder, whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2018
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2018.2817233